Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts

We prove better lower bounds on additive spanners and emulators, which are lossy compression schemes for undirected graphs, as well as lower bounds on shortcut sets, which reduce the diameter of directed graphs. We show that any O(n)-size shortcut set cannot bring the diameter below Ω(n1/6), and that any O(m)-size shortcut set cannot bring it below Ω(n1/11). These improve Hesse’s [15] lower bound of Ω(n1/17). By combining these constructions with Abboud and Bodwin’s [1] edge-splitting technique, we get additive stretch lower bounds of +Ω(n1/13) for O(n)-size spanners and +Ω(n1/18) for O(n)-size emulators. These improve Abboud and Bodwin’s +Ω(n1/22) lower bounds. 1998 ACM Subject Classification G.2.2 [Discrete Mathematics]: Graph Theory—Graph algorithms